CUET PG MCA Data Structures Previous Year Question Paper and Solution with PDF

Aspire's Library

A Place for Latest Exam wise Questions, Videos, Previous Year Papers,
Study Stuff for MCA Examinations

CUET PG MCA
Previous Year Questions

CUET PG MCA
Previous Year Questions
CUET PG MCA

CUET PG MCA Previous Year Questions (PYQs)

CUET PG MCA Data Structures PYQ

Qus : 1CUET PG MCA PYQ

Consider implementation of database. Among the following options, choose the most appropriate data structure for this

1
2
3
4
Go to Discussion

CUET PG MCA Previous Year PYQCUET PG MCA CUET 2024 PYQ

Solution

Qus : 2CUET PG MCA PYQ

Each node is having a successor node in ________________:

1
2
3
4
Go to Discussion

CUET PG MCA Previous Year PYQCUET PG MCA CUET 2024 PYQ

Solution

Qus : 3CUET PG MCA PYQ

Consider a completely skewed (left / right) binary search tree with n elements. What is the worst case time complexity of searching an element in this tree?

1
2
3
4
Go to Discussion

CUET PG MCA Previous Year PYQCUET PG MCA CUET 2024 PYQ

Solution

Qus : 4CUET PG MCA PYQ

If we want to find last node of a singly linked list then the correct coding is

1
2
3
4
Go to Discussion

CUET PG MCA Previous Year PYQCUET PG MCA CUET 2024 PYQ

Solution

Qus : 5CUET PG MCA PYQ

Arrange the following in the increasing order of their asympotic complexities:

(A) Insertion sort (best case)

(B) Bubble sort (worst case)

(D) Merge sort (worst case)

1
2
3
4
Go to Discussion

CUET PG MCA Previous Year PYQCUET PG MCA CUET 2024 PYQ

Solution

Qus : 6CUET PG MCA PYQ

The following integers are needed to be stored in ascending order using bubble sort.

5, 8, 22, 18, 1

Following are the results of various passes during the sorting process.

1
2
3
4
Go to Discussion

CUET PG MCA Previous Year PYQCUET PG MCA CUET 2024 PYQ

Solution

Qus : 7CUET PG MCA PYQ

What are the ways to implement a priority Queue?

(A) Arrays

(B) Fibonacci tree

(D) Linked list

Choose the correct answer from the options given below:

1
2
3
4
Go to Discussion

CUET PG MCA Previous Year PYQCUET PG MCA CUET 2024 PYQ

Solution

Ways to Implement a Priority Queue

The correct answer is:

(A) Arrays, (C) Heap Data Structure, and (D) Linked List

Explanation:

Arrays:
- Unsorted Array: Insertion is O(1), Deletion is O(n).
- Sorted Array: Insertion is O(n), Deletion is O(1).
Heap Data Structure:
- Binary heaps are commonly used for efficient implementation.
- Insertion and Deletion take O(log n) time.
Linked List:
- Can be implemented as sorted or unsorted.
- Efficiency depends on the choice of implementation.

Why not Fibonacci Tree?

Fibonacci trees are not used directly for priority queues. However, Fibonacci heaps (a separate data structure) can implement priority queues efficiently.

Qus : 8CUET PG MCA PYQ

Match List – I with List – II

List - I (Algorithms)	List - II (Complexity)
(A) Bellman - Ford algorithm (with adjacencylist representation)	(I) $O(\|V\|^2)$
(B) Dijkstra Algorithm	(II) O((V+E) logV)
(C) Prim’s Algorithm	(III) O(mn)
(D) Topological sorting (with adjacency list representation)	(IV) O(m+n)

Choose the correct answer from the options given below: